package com.搜索和回溯;


class Solution2 {
    //递归法
    public TreeNode mirrorTree(TreeNode root) {

        //递归终止
        if(root==null) return null;
        TreeNode node=root.left;
        root.left=mirrorTree(root.right);
        root.right=mirrorTree(node);
        return root;
    }
}
public class 剑指Offer27二叉树的镜像 {
    public static void main(String[] args) {
        System.out.println();
    }
}
